0.06/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.06/0.12 % Command : run_E %s %d THM 0.12/0.33 % Computer : n028.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 1440 0.12/0.33 % WCLimit : 180 0.12/0.33 % DateTime : Thu Jul 4 06:01:54 EDT 2024 0.12/0.33 % CPUTime : 0.19/0.47 Running higher-order theorem proving 0.19/0.47 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.2gjmmisAli/E---3.1_13568.p 0.19/0.49 # Version: 3.2.0-ho 0.19/0.49 # Preprocessing class: HSMSSMSSSSSNFFN. 0.19/0.49 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.19/0.49 # Starting new_ho_10 with 900s (5) cores 0.19/0.49 # Starting new_bool_1 with 180s (1) cores 0.19/0.49 # Starting full_lambda_5 with 180s (1) cores 0.19/0.49 # Starting new_ho_10_unif with 180s (1) cores 0.19/0.49 # new_ho_10_unif with pid 13650 completed with status 0 0.19/0.49 # Result found by new_ho_10_unif 0.19/0.49 # Preprocessing class: HSMSSMSSSSSNFFN. 0.19/0.49 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.19/0.49 # Starting new_ho_10 with 900s (5) cores 0.19/0.49 # Starting new_bool_1 with 180s (1) cores 0.19/0.49 # Starting full_lambda_5 with 180s (1) cores 0.19/0.49 # Starting new_ho_10_unif with 180s (1) cores 0.19/0.49 # No SInE strategy applied 0.19/0.49 # Search class: HGHNS-FFSF11-SFFFFFNN 0.19/0.49 # partial match(1): HGHNF-FFSF11-SFFFFFNN 0.19/0.49 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 0.19/0.49 # Starting new_ho_10 with 98s (1) cores 0.19/0.49 # new_ho_10 with pid 13655 completed with status 0 0.19/0.49 # Result found by new_ho_10 0.19/0.49 # Preprocessing class: HSMSSMSSSSSNFFN. 0.19/0.49 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.19/0.49 # Starting new_ho_10 with 900s (5) cores 0.19/0.49 # Starting new_bool_1 with 180s (1) cores 0.19/0.49 # Starting full_lambda_5 with 180s (1) cores 0.19/0.49 # Starting new_ho_10_unif with 180s (1) cores 0.19/0.49 # No SInE strategy applied 0.19/0.49 # Search class: HGHNS-FFSF11-SFFFFFNN 0.19/0.49 # partial match(1): HGHNF-FFSF11-SFFFFFNN 0.19/0.49 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 0.19/0.49 # Starting new_ho_10 with 98s (1) cores 0.19/0.49 # Preprocessing time : 0.001 s 0.19/0.49 # Presaturation interreduction done 0.19/0.49 0.19/0.49 # Proof found! 0.19/0.49 # SZS status Theorem 0.19/0.49 # SZS output start CNFRefutation 0.19/0.49 thf(decl_22, type, a: $i). 0.19/0.49 thf(decl_23, type, factorial_plus_one: $i > $i). 0.19/0.49 thf(decl_24, type, less: $i > $i > $o). 0.19/0.49 thf(decl_25, type, prime: $i > $o). 0.19/0.49 thf(decl_26, type, prime_divisor: $i > $i). 0.19/0.49 thf(decl_27, type, divides: $i > $i > $o). 0.19/0.49 thf(cNUM016_1, conjecture, ~((((((((((((![X1:$i, X2:$i, X3:$i]:(((divides @ X1 @ X3)|~((divides @ X2 @ X3))|~((divides @ X1 @ X2))))&![X1:$i]:((less @ X1 @ (factorial_plus_one @ X1))))&![X1:$i]:(((divides @ (prime_divisor @ X1) @ X1)|(prime @ X1))))&![X1:$i]:(((less @ (factorial_plus_one @ a) @ X1)|~((less @ a @ X1))|~((prime @ X1)))))&(prime @ a))&![X1:$i]:(((prime @ X1)|(less @ (prime_divisor @ X1) @ X1))))&![X1:$i]:(((prime @ X1)|(prime @ (prime_divisor @ X1)))))&![X1:$i, X2:$i]:((~((divides @ X1 @ (factorial_plus_one @ X2)))|(less @ X2 @ X1))))&![X1:$i, X2:$i]:((~((less @ X2 @ X1))|~((divides @ X1 @ X2)))))&![X1:$i]:((divides @ X1 @ X1)))&![X1:$i, X2:$i]:((~((less @ X2 @ X1))|~((less @ X1 @ X2)))))&![X1:$i]:(~((less @ X1 @ X1))))), file('/export/starexec/sandbox2/tmp/tmp.2gjmmisAli/E---3.1_13568.p', cNUM016_1)). 0.19/0.49 thf(c_0_1, negated_conjecture, ~(~((((((((((((![X1:$i, X2:$i, X3:$i]:(((divides @ X1 @ X3)|~(divides @ X2 @ X3)|~(divides @ X1 @ X2)))&![X1:$i]:((less @ X1 @ (factorial_plus_one @ X1))))&![X1:$i]:(((divides @ (prime_divisor @ X1) @ X1)|(prime @ X1))))&![X1:$i]:(((less @ (factorial_plus_one @ a) @ X1)|~(less @ a @ X1)|~(prime @ X1))))&(prime @ a))&![X1:$i]:(((prime @ X1)|(less @ (prime_divisor @ X1) @ X1))))&![X1:$i]:(((prime @ X1)|(prime @ (prime_divisor @ X1)))))&![X1:$i, X2:$i]:((~(divides @ X1 @ (factorial_plus_one @ X2))|(less @ X2 @ X1))))&![X1:$i, X2:$i]:((~(less @ X2 @ X1)|~(divides @ X1 @ X2))))&![X1:$i]:((divides @ X1 @ X1)))&![X1:$i, X2:$i]:((~(less @ X2 @ X1)|~(less @ X1 @ X2))))&![X1:$i]:(~(less @ X1 @ X1))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cNUM016_1])])). 0.19/0.49 thf(c_0_2, negated_conjecture, ![X20:$i, X21:$i, X22:$i, X23:$i, X24:$i, X25:$i, X26:$i, X27:$i, X28:$i, X29:$i, X30:$i, X31:$i, X32:$i, X33:$i, X34:$i, X35:$i]:((((((((((((((divides @ X20 @ X22)|~(divides @ X21 @ X22)|~(divides @ X20 @ X21))&(less @ X23 @ (factorial_plus_one @ X23)))&((divides @ (prime_divisor @ X24) @ X24)|(prime @ X24)))&((less @ (factorial_plus_one @ a) @ X25)|~(less @ a @ X25)|~(prime @ X25)))&(prime @ a))&((prime @ X26)|(less @ (prime_divisor @ X26) @ X26)))&((prime @ X27)|(prime @ (prime_divisor @ X27))))&(~(divides @ X28 @ (factorial_plus_one @ X29))|(less @ X29 @ X28)))&(~(less @ X31 @ X30)|~(divides @ X30 @ X31)))&(divides @ X32 @ X32))&(~(less @ X34 @ X33)|~(less @ X33 @ X34)))&~(less @ X35 @ X35))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])). 0.19/0.49 thf(c_0_3, negated_conjecture, ![X2:$i, X1:$i]:((~((less @ X1 @ X2))|~((less @ X2 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.19/0.49 thf(c_0_4, negated_conjecture, ![X1:$i]:(((less @ (factorial_plus_one @ a) @ X1)|~((less @ a @ X1))|~((prime @ X1)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.19/0.49 thf(c_0_5, negated_conjecture, ![X1:$i]:(~((less @ X1 @ X1))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.19/0.49 thf(c_0_6, negated_conjecture, ![X1:$i]:((less @ X1 @ (factorial_plus_one @ X1))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.19/0.49 thf(c_0_7, negated_conjecture, ![X1:$i]:((~((less @ X1 @ (factorial_plus_one @ a)))|~((less @ a @ X1))|~((prime @ X1)))), inference(spm,[status(thm)],[c_0_3, c_0_4])). 0.19/0.49 thf(c_0_8, negated_conjecture, ![X1:$i]:(((prime @ X1)|(less @ (prime_divisor @ X1) @ X1))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.19/0.49 thf(c_0_9, negated_conjecture, ~((prime @ (factorial_plus_one @ a))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5, c_0_4]), c_0_6])])). 0.19/0.49 thf(c_0_10, negated_conjecture, ![X1:$i, X2:$i]:(((less @ X2 @ X1)|~((divides @ X1 @ (factorial_plus_one @ X2))))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.19/0.49 thf(c_0_11, negated_conjecture, ![X1:$i]:(((divides @ (prime_divisor @ X1) @ X1)|(prime @ X1))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.19/0.49 thf(c_0_12, negated_conjecture, (~((less @ a @ (prime_divisor @ (factorial_plus_one @ a))))|~((prime @ (prime_divisor @ (factorial_plus_one @ a))))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7, c_0_8]), c_0_9])). 0.19/0.49 thf(c_0_13, negated_conjecture, ![X1:$i]:(((less @ X1 @ (prime_divisor @ (factorial_plus_one @ X1)))|(prime @ (factorial_plus_one @ X1)))), inference(spm,[status(thm)],[c_0_10, c_0_11])). 0.19/0.49 thf(c_0_14, negated_conjecture, ~((prime @ (prime_divisor @ (factorial_plus_one @ a)))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_9])). 0.19/0.49 thf(c_0_15, negated_conjecture, ![X1:$i]:(((prime @ X1)|(prime @ (prime_divisor @ X1)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.19/0.49 thf(c_0_16, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_9]), ['proof']). 0.19/0.49 # SZS output end CNFRefutation 0.19/0.49 # Parsed axioms : 7 0.19/0.49 # Removed by relevancy pruning/SinE : 0 0.19/0.49 # Initial clauses : 18 0.19/0.49 # Removed in clause preprocessing : 6 0.19/0.49 # Initial clauses in saturation : 12 0.19/0.49 # Processed clauses : 38 0.19/0.49 # ...of these trivial : 0 0.19/0.49 # ...subsumed : 6 0.19/0.49 # ...remaining for further processing : 32 0.19/0.49 # Other redundant clauses eliminated : 0 0.19/0.49 # Clauses deleted for lack of memory : 0 0.19/0.49 # Backward-subsumed : 1 0.19/0.49 # Backward-rewritten : 0 0.19/0.49 # Generated clauses : 20 0.19/0.49 # ...of the previous two non-redundant : 17 0.19/0.49 # ...aggressively subsumed : 0 0.19/0.49 # Contextual simplify-reflections : 0 0.19/0.49 # Paramodulations : 20 0.19/0.49 # Factorizations : 0 0.19/0.49 # NegExts : 0 0.19/0.49 # Equation resolutions : 0 0.19/0.49 # Disequality decompositions : 0 0.19/0.49 # Total rewrite steps : 5 0.19/0.49 # ...of those cached : 2 0.19/0.49 # Propositional unsat checks : 0 0.19/0.49 # Propositional check models : 0 0.19/0.49 # Propositional check unsatisfiable : 0 0.19/0.49 # Propositional clauses : 0 0.19/0.49 # Propositional clauses after purity: 0 0.19/0.49 # Propositional unsat core size : 0 0.19/0.49 # Propositional preprocessing time : 0.000 0.19/0.49 # Propositional encoding time : 0.000 0.19/0.49 # Propositional solver time : 0.000 0.19/0.49 # Success case prop preproc time : 0.000 0.19/0.49 # Success case prop encoding time : 0.000 0.19/0.49 # Success case prop solver time : 0.000 0.19/0.49 # Current number of processed clauses : 19 0.19/0.49 # Positive orientable unit clauses : 3 0.19/0.49 # Positive unorientable unit clauses: 0 0.19/0.49 # Negative unit clauses : 4 0.19/0.49 # Non-unit-clauses : 12 0.19/0.49 # Current number of unprocessed clauses: 3 0.19/0.49 # ...number of literals in the above : 7 0.19/0.49 # Current number of archived formulas : 0 0.19/0.49 # Current number of archived clauses : 13 0.19/0.49 # Clause-clause subsumption calls (NU) : 14 0.19/0.49 # Rec. Clause-clause subsumption calls : 13 0.19/0.49 # Non-unit clause-clause subsumptions : 2 0.19/0.49 # Unit Clause-clause subsumption calls : 5 0.19/0.49 # Rewrite failures with RHS unbound : 0 0.19/0.49 # BW rewrite match attempts : 0 0.19/0.49 # BW rewrite match successes : 0 0.19/0.49 # Condensation attempts : 38 0.19/0.49 # Condensation successes : 0 0.19/0.49 # Termbank termtop insertions : 1251 0.19/0.49 # Search garbage collected termcells : 183 0.19/0.49 0.19/0.49 # ------------------------------------------------- 0.19/0.49 # User time : 0.004 s 0.19/0.49 # System time : 0.002 s 0.19/0.49 # Total time : 0.006 s 0.19/0.49 # Maximum resident set size: 1780 pages 0.19/0.49 0.19/0.49 # ------------------------------------------------- 0.19/0.49 # User time : 0.005 s 0.19/0.49 # System time : 0.005 s 0.19/0.49 # Total time : 0.010 s 0.19/0.49 # Maximum resident set size: 1704 pages 0.19/0.49 % E---3.1 exiting 0.19/0.49 % E exiting 0.19/0.49 EOF